Methods and systems for determining an unread message count

ABSTRACT

Exemplary embodiments relate to techniques for providing more accurate counts relating to unread messages in a communications system. Conventionally, the unread count for an app may be inaccurate, because the local application does not synchronize its understanding of the unread messages with the server. In the described embodiments, both the server and the application inform each other of what they understand the unread count to be. The client also informs the server of when the local application is backgrounded and foregrounded. With this information, the server is able to update its badge count more accurately, and the local client is able to estimate how far off the server&#39;s count is. Using the techniques described herein, the server may inform the client of its badge-count understanding in a way that does not cause the application to wake up on the local device, thereby resulting in less battery consumption.

BACKGROUND

A number of messaging and email systems maintain a count of the unread messages that have been received by the system but have not yet been reviewed by the recipient. This unread message count may be used in several ways; for instance, FIG. 1 depicts an app icon 102 associated with a messaging service and displayed on a main interface 100 of a mobile operating system. The app icon 102 includes a badge 104 showing the number of unread messages pending for a user of the app. This allows the user to determine, at a glance, whether they need to open the app to review new messages.

Other services may use the unread message count in a similar way. In another example, an email program may display, next to each mailbox, the number of messages in that mailbox that have not yet been reviewed. Still further, the number and/or trend of unread messages may be used by analytics systems to calculate statistics, make predictions, or perform other actions based on the number of unread messages in a user's account.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts an exemplary interface displaying an unread message count;

FIG. 2 depicts an exemplary environment suitable for use with embodiments described herein.

FIG. 3A is a Venn diagram depicting a relationship between various parameters used in exemplary embodiments.

FIG. 3B is a timing diagram depicting an exemplary exchange of information between components of the environment;

FIG. 4 depicts a flowchart showing an exemplary method for determining an unread message count;

FIG. 5A is a block diagram providing an overview of a system including an exemplary centralized communications service;

FIG. 5B is a block diagram providing an overview of a system including an exemplary distributed communications service;

FIG. 5C depicts the social networking graph of FIGS. 5A-5B in more detail;

FIG. 6 is a block diagram depicting an example of a system for a messaging service;

FIG. 7 is a block diagram illustrating an exemplary computing device suitable for use with exemplary embodiments;

FIG. 8 depicts an exemplary communication architecture; and

FIG. 9 is a block diagram depicting an exemplary multicarrier communications device.

DETAILED DESCRIPTION

In many cases, a messaging or email system's count of unread messages may be inaccurate. With reference to FIG. 2, a communications system 200 may include a sending client 202-1, a receiving client 202-2, and a server 204. The client 202 may run a communications application 204, which may be (e.g.) a simple message service (SMS) application, another type of synchronous or asynchronous messaging application, a telecommunication application (e.g., a voicemail application), an email application, or any other type of communications application that exchanges messages between users and/or software constructs.

When a message is sent by the sending client 202-1 and addressed to the receiving client 202-2, it is first transmitted to the server 204. The server 204 maintains a message queue 206 for each client. When a message designated for the receiving client 202-2 is received at the server 204, the message is added to the queue 206 for the receiving client.

Within the queue 206, each message may be associated with one or more statuses. When the message has been received by the server 204 but not yet delivered to the receiving client 202-2, the message may be in an “undelivered” state. When the receiving client 202-2 establishes a connection 208 to the server 204 (in one example, the connection may be an Extensible Messaging and Presence Protocol, or “XMPP”, connection), the server 204 may attempt to send the undelivered messages in the queue 206 using a push message 210. For instance, for messaging applications running on the iOS operating system, the push message 210 may be a PUSH NOTIFICATION SERVICE (APNS). For other implementations, other types of push messages 210 may be used. When the message is successfully pushed to the receiving client, the messages status in the queue 206 may be updated from “undelivered” to “delivered.”

The part of the queue 206 containing messages that have not yet been delivered (e.g., because the receiving client 202-2 is not connected to the server 204) may be referred to as an offline queue. In some messaging implementations, all the messages received by the server 204 are archived at the server 204; in others, messages may be deleted from the server 204 when they are delivered to the receiving client 202-2.

In one embodiment, a communications application 212 on the receiving client 202-2 may communicate with the server 204 to retrieve the messages designated for the receiving client 202-2. The communications application 212 may be capable of operating in a foreground state on the receiving client 202-2 or in a background state of the receiving client 202-2.

In the communication application, 212, messages may either be “read” or “unread.” Typically, a message is considered to be “read” when it is selected in a messaging/email application at the receiving client 202-2 and displayed on an interface for review (although messages may become “read” in other ways). In the examples described below, it is assumed that bringing an application into the foreground marks all outstanding unread messages as read, although other implementations are also possible. Depending on the manner in which messages are marked as read, one of ordinary skill in the art will understand that the states and procedures described below may need to be adjusted slightly to account for when and how messages are marked as read. As noted above, the number of messages having the “unread” status may be used for various purposes, such as setting a badge notification on an icon of the communication application 212.

One challenge in this setup is to accurately determine the number of unread messages designated for the receiving client 202-2 while the receiving client 202-2 is operating in a background state. Conventionally, the number of unread messages is set to the size of the offline queue at the server 204; if a message is undelivered, it cannot yet have been read. The server 204 may inform the receiving client 202-2 of the size of the offline queue using a push message. However, this strategy tends to undercount the number of unread messages, because it does not consider messages that have been delivered to the receiving client 202-2 (and are thus not in the offline queue 206) but have not yet been read on the receiving client 202-2. Moreover, not all receiving clients 202-2 are capable of receiving all types of push notifications—for instance, iOS 7 does not receive VOIP push messages.

Another problem is that this strategy does not account for messages in communication threads that have been muted. A communication thread generally refers to a group of messages transmitted between the same group of users. When a message is received in such a communication thread, a notification is typically displayed on the interface of the receiving client 202-2. In some cases, this may be undesirable, and so the user may “mute” notifications of incoming messages for one or more groups. However, it may still be desirable to include the number of unread messages from muted conversations in the unread message count. However, because push notifications are not always sent for messages in muted groups (because such messages may not be loaded into the offline message queue 206), the unread message count may not be updated when messages are received for a muted group.

A potential solution to this problem is to send push messages (e.g., VOIP push messages) for muted groups. However, as noted above, certain types of clients are not capable of receiving all types of push messages. Still further, this solution would cause the receiving client 202-2 to establish unnecessary XMPP connections with the server, which would increase the server load and battery drain at the receiving client 202-2.

Thus, there is a need for an improved technique for estimating the number of unread messages designated for a particular client. As described in more detail below, according to exemplary embodiments both the server 204 and the communication application 212 inform each other of what they understand the unread count to be. The receiving client 202-2 also informs the server 204 of when the local application 212 is backgrounded and foregrounded. With this information, the server 204 is able to update its badge count more accurately, and the local client 202-2 is able to estimate how far off the server's count is. In some embodiments, the server 204 may inform the client of its badge-count understanding using a particular kind of push notification (APNS) which allows the badge count to be loaded into the payload of the notification but does not cause the application to wake up on the local device. The result is a more accurate count with fewer client wakeups (and hence less battery consumption).

For example, consider the (conventional) case where the application is running in the background on the receiving client 202-2, at which time it receives a push notification indicating that 10 messages are unread and awaiting on the server. The client application may then be brought into the foreground. This action may cause the client's number of unread messages to drop to 0. The client application may then be backgrounded.

After this sequence of events, the client believes the unread message count to be 0, whereas the server believes the unread message count to be 10. If the server then receives another message, it increments the unread message count to 11, which is incorrect (the correct number, from the client's perspective, is the 1 new message just received).

It can be seen from this example that, although the unread message count received from the server is inaccurate, the client has partial information about what the server “knows.” When the application is backgrounded, the application understands that the server still has an unread count of 10 (based on the last push message received); thus, when a new unread count is received from the server, the client can subtract 10 from the unread count to derive the correct number.

In exemplary embodiments described below, the following changes (among others) are made to the conventional system described above: the client informs the server when the client application is foregrounded (which may reset the unread message count); the server informs the client of its own understanding of the unread message count; and the client also informs the server of its understanding of the unread message count. With this information, both the client and the server can derive a more accurate count and better stay in sync with each other.

This brief summary is intended to serve as a non-limiting introduction to the concepts discussed in more detail below. However, before discussing further exemplary embodiments, a brief note on data privacy is first provided. A more detailed description of privacy settings and authentication will be addressed in connection with the following Figures.

A Note on Data Privacy

Some embodiments described herein make use of training data or metrics that may include information voluntarily provided by one or more users. In such embodiments, data privacy may be protected in a number of ways.

For example, the user may be required to opt in to any data collection before user data is collected or used. The user may also be provided with the opportunity to opt out of any data collection. Before opting in to data collection, the user may be provided with a description of the ways in which the data will be used, how long the data will be retained, and the safeguards that are in place to protect the data from disclosure.

Any information identifying the user from which the data was collected may be purged or disassociated from the data. In the event that any identifying information needs to be retained (e.g., to meet regulatory requirements), the user may be informed of the collection of the identifying information, the uses that will be made of the identifying information, and the amount of time that the identifying information will be retained. Information specifically identifying the user may be removed and may be replaced with, for example, a generic identification number or other non-specific form of identification.

Once collected, the data may be stored in a secure data storage location that includes safeguards to prevent unauthorized access to the data. The data may be stored in an encrypted format. Identifying information and/or non-identifying information may be purged from the data storage after a predetermined period of time.

Although particular privacy protection techniques are described herein for purposes of illustration, one of ordinary skill in the art will recognize that privacy protected in other manners as well. Further details regarding data privacy are discussed below in the section describing network embodiments.

Assuming a user's privacy conditions are met, exemplary embodiments may be deployed in a wide variety of messaging systems, including messaging in a social network or on a mobile device (e.g., through a messaging client application or via short message service), among other possibilities. An overview of exemplary logic and processes for engaging in synchronous video conversation in a messaging system is next provided.

As an aid to understanding, a series of examples will first be presented before detailed descriptions of the underlying implementations are described. It is noted that these examples are intended to be illustrative only and that the present invention is not limited to the embodiments shown.

Counting Unread Messages

Reference is now made to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding thereof. However, the novel embodiments can be practiced without these specific details. In other instances, well known structures and devices are shown in block diagram form in order to facilitate a description thereof. The intention is to cover all modifications, equivalents, and alternatives consistent with the claimed subject matter.

In the Figures and the accompanying description, the designations “a” and “b” and “c” (and similar designators) are intended to be variables representing any positive integer. Thus, for example, if an implementation sets a value for a=5, then a complete set of components 122 illustrated as components 122-1 through 122-a may include components 122-1, 122-2, 122-3, 122-4, and 122-5. The embodiments are not limited in this context.

In order to improve the accuracy of unread message counts, exemplary embodiments incorporate both the client and server, working together, to minimize the error associated with estimating the count while the client is offline. The following example, described for illustrative purposes, concerns a messaging application in which text or multimedia messages may be exchanged, and users may also engage in video calls. An unread message or a missed call may contribute to the unread message count.

In order to estimate the unread message count, the following values may be tracked:

-   -   S: The server's estimate of what the unread message count should         be.     -   C: The client's estimate of S.     -   Cq: The client's estimate of the length of the server's offline         queue.     -   O: The set of messages on the client that have not been handled         and count as unread. “Handled,” in this context, may mean a         message that has been decrypted (in an end-to-end encrypted         system) and added to a message database; alternatively or in         addition, “handled” may refer to a message that has been         negatively acknowledged (“NACKed”) or dropped for being         malformed.     -   L: The number of already-handled messages counted as unread.     -   OC: The number of messages counted by C that also belong to O.     -   LC: The number of messages counted by C that are also counted by         L.     -   U: The number of messages in C that are known (e.g., by the         client) to be read.     -   B: The client's estimate of the correct unread message count.         Any time the value of B changes, the client may update an icon         badge or message count on an interface to the same value.

Each of these values may be initialized to 0. Given these definitions, the following statements are true:

-   -   C≥OC+LC+U     -   All numeric values are non-negative     -   B=C+|O|+L−OC−LC−U     -   OC≤|O|     -   LC≤L     -   When the communication application is in the foreground, C=U     -   When the communication application is in the foreground, L=0     -   When the communication application is in the foreground, O={ }     -   When the communication application is connected in the         foreground, S=C=U=L=LC=OC=0

With reference to the state diagram depicted in FIG. 3B, the following events are defined:

-   -   msg: Message received, but not processed     -   inv: Message processed as invisible (i.e., the message is not         intended to increment the unread count)     -   vis: Message processed as visible (i.e., the message is intended         to increment the unread count)     -   push: Push received on client     -   we read: Webclient reads messages     -   activate: App activated (foregrounded)     -   deactivate: App deactivated (backgrounded)     -   open: socket (e.g., XMPP socket) connected, receiving offline         queue     -   online: Transition out of online mode     -   disconnect: socket connection lost

Intuitively, S counts the last-known unread message count plus newly-arrived messages, which represents the server's best estimate of the unread message count. U counts messages that are “black-holed,” such as when the application is foregrounded or a message is deemed not to be user-visible after decryption while offline. S tends to include messages in U. In this sense, U represents an adjustment factor for S that is known only to the client.

O contains messages whose decrypted/dropped disposition is unknown, but are presumed visible.

All messages belonging to O, C, or L and not in U count as unread. OC and LC exist to solve the problem of double-counting these messages. The Venn diagram depicted in FIG. 3A shows the relationships between these parameters.

To handle client termination, C, L, U, Cq, LC, and |O| are saved so that they can survive unexpected application termination. When the application finishes launching, it sets OC to 0. Other values may be restored from their last-saved state. The saved value of |O| will be added to Cq.

The states shown in FIG. 3B are a combination of the app's activation state and the socket (e.g., XMPP socket) connection state, as indicated below:

-   -   Foreground/Background: Corresponds to whether the app is active         or not. The client communicates this information to the server         with a new stanza <ib><active state=“true|false|></ib>. The         server may assume that the state is background by default.     -   Disconnected: There is no socket connection, or the socket         connection is in the process of being created or shut down.     -   Offline: There is a socket connection, but the offline queue is         being drained. The Offline state ends when the client gets the         stanza <ib><offline count=“[Count]”></ib>     -   Connected: There is a socket connection and the offline queue         has been fully drained.

As shown in FIG. 3B, the client may perform the following actions when the following events occur:

At 301, a push is received while the application is in the background and socket connection state is “disconnected.” The action to be taken in response to this event depends on whether the client is able to obtain a slice of CPU time.

If so, then C is set to the unread message count in the push notification. Cq is updated by adding to it 0 or the unread message count in the push notification—C, whichever is greater. The following pseudocode may then be implemented:

-   -   if U>0: U←U−1     -   else if OC>0: OC←OC−1     -   else: LC←LC−1

Otherwise, the unread message count is set to the value in the push payload. Although this may not be an entirely accurate representation of the unread message count, the cost in battery power and server load to handle this limited scenario with further notifications (e.g., VOIP push notifications) is not likely to justify the increased accuracy.

At 302, a message is received on the server while the client is in the background and disconnected. In this case, S is incremented (S←S+1). The server may send a push message with an unread message count of S.

At 303, the application may be foregrounded while in the disconnected state. In this case:

-   -   U←C     -   O←{ }     -   OC←0     -   LC←0     -   L←0

At 304, a socket connection may finish processing the offline queue while the application is in the background. In this case, the following pseudocode may be implemented

-   -   temp←B     -   Client sends a message (ib) to the server with count=temp     -   Cq←0     -   C←temp     -   OC←|O|     -   U←0     -   LC←L

At 305, a message may be received on the server while the application is in the foregrounded and disconnected. The result is the same as occurs in 302 (i.e., S is incremented and a push is sent to the client with an unread message count of S).

At 306, the client receives a push while in the foreground and disconnected. As a precondition in this state, L=0 and C=U. In response to this event, the following pseudocode may be implemented:

-   -   Cq←Cq+MAX (0,S−C)     -   C←S     -   U←S

At 307, the application is backgrounded while in the disconnected state. In this event, as a precondition, L=0 and C=U.

At 308, a socket connection (e.g, an XMPP connection) may be opened while the application is in the foreground. As a precondition, L=0, C=U, and O={ }. In response to this event, the client may send a message indicating that the “active state” is “true” (e.g., <ib><active state=true></ib>). C and U may each be set to 0.

At 309, a message may be received (at both the client and the server) while the application is in the background and in the connected state. The values of S, C, and OC may each be incremented in response to this event (S←S+1; C←C+1; OC←OC+1). The message may be added to O (O←O∪ Message).

At 310, the application is foregrounded while in the connected state. In this case, the client sends a message to the server indicating that its active state is set to true, and the server (in response to receiving the active state message) sets S to 0. The client may set C, L, U, OC, and LC to 0, and O to { }.

At 311, the application is in the background and connected, and is then disconnected. No action is taken in response to this event.

At 312, a message is received (at both the client and server) while the application is in the foreground and connected. No action is taken in response to this event.

At 313, the application is in the foreground and becomes disconnected. No action is taken in response to this event.

At 314, the application is backgrounded while connected. As a precondition to this state, C, S, L, and U are 0. In response to this event, the client sends the server a message updating its active state to false.

At 315, a message may be read using webclient while the application is disconnected in the background. In response to this event, the value of L is updated to 0 or L−1, whichever is higher. If LC>0, then LC is decremented (LC←LC−1) and U is incremented (U←U+1).

At 316, N messages may be read using webclient while the application is disconnected in the foreground. As a precondition to this event, L=0.

At 317, a message may be read using webclient while the application is connected in the background. In this case, L is updated to 0 or L−1, whichever is greater. If LC>0, then LC and C are decremented (LC←LC−1; C←C−1) The client may send a message to the server indicating an unread count of B, and the server may update S to correspond to B.

At 318, N messages may be read using webclient while the application is connected in the foreground. As a precondition to this state, C, S, L, and U are each 0, and 0 is set to { }.

At 319, the client may receive a push message from the server while the application is in the background and connected. In response, the client may set (e.g.) the badge on an associated application icon to B.

At 320, the client receives a push notification while the application is in the foreground and connected. As a precondition, C, S, L, and U are each 0, and O is { }. In response to this event, the client may reset its badge to B.

At 321, the client may open a socket (e.g., XMPP) connection while the application is in the background. No action is taken in response to this event.

At 322, the client may disconnect while in offline mode and the application is in the background. No action is taken in response to this event.

At 323, the client may disconnect while in offline mode and the application is in the foreground. No action is taken in response to this event.

At 324, the application is foregrounded while in offline mode. In response, U is set to C, O is set to { }, and OC, LC, and L are each set to 0. The client may send a message to the server updating its active state to true, and in response the server may set its value for S to 0.

At 325, the application is backgrounded while in offline mode. As a precondition, C, S, L, and U are 0, and O is { }. In this case, the client sends a message updating its active state to false with the server.

At 326, the client may receive a push notification while the application is foregrounded and in offline mode. As a precondition, C, S, L, and U are 0. In response to this event, the client may reset the badge on the application icon to B.

At 327, the client may receive a message while the application is foregrounded in the offline mode. As a precondition, C, S, L, and U are 0, and O is { }. The value of Cq may be set to 0 or Cq−1, whichever is higher.

At 328, a message may be read using webclient while the application is in the offline mode in the foreground. As a precondition, C, S, L, and U are 0, and O is { }.

At 329, a message may be read using webclient while in offline mode in the background. In response, the value of L may be updated to 0 or L−1, whichever is higher. If LC>0, then LC is decremented (LC←LC−1) and U is incremented (U←U+1).

At 330, the client may receive a message in offline mode while the application is in the background. In response, the message may be added to O (O←O∪Message), and OC may be incremented (OC←OC+1). If Cq>0, then Cq is decremented (Cq←Cq−1). Otherwise, C is incremented C←C+1).

At 331, a push notification may be received while in offline mode while the application is backgrounded. In this case, the client resets the badge on the app icon to B.

At 332, a socket connection finishes processing the offline queue while the application is in the foreground. As a precondition, C, S, L, and U are 0.

At 333, a visible message may be decrypted while the application is disconnected in the background. If the message is in O, then L is incremented (L←L+1); furthermore, if OC>0, OC is decremented (OC←OC−1) and LC is incremented (LC←LC+1). The message is removed from O (O←O\Message).

At 334, an invisible message is decrypted, or a message is dropped while the application is disconnected in the background. If the message is in O, then a determination is made if OC>0. If so, OC is decremented (OC←OC−1) and U is incremented (U←U+1). The message is removed from O (O←O\Message).

At 335, a visible message is decrypted while the application is disconnected in the foreground. No action is taken in response to this event.

At 336, an invisible message is decrypted, or a message is dropped while the application is disconnected in the foreground. No action is taken in response to this event.

At 337, a visible message is decrypted while the application is in offline mode in the background. If the message is in O, L is incremented (L←L+1); furthermore, if OC>0, OC is decremented (OC←OC−1) and LC is incremented (LC←LC+1). The message is removed from O (O←O\Message), and the client sends a message to the server with a count of B.

At 338, an invisible message may be decrypted, or a message may be dropped, while the application is in offline mode in the background. If the message is in O, the message is removed from O (O←O\Message). If OC>0, OC is decremented (OC←OC−1) and U is incremented (U←U+1). The client sends a message to the server with a count of B.

At 339, a visible message may be decrypted while the application is in offline mode in the foreground. No action is taken in response to this event.

At 340, an invisible message may be decrypted, or a message may be dropped, while the application is in offline mode in the background. No action is taken in response to this event.

At 341, a visible message may be decrypted while the application is connected in the background. If the message is in O:

-   -   L is incremented (L←L+1)     -   if OC>0, OC is decremented (OC←OC−1) and LC is incremented         (LC←LC+1)     -   The message is removed from O (O←O\Message)     -   The client sends a message to the server with a count of B     -   The server updates S to B (S←B)

At 342, an invisible message is decrypted, or a message is dropped, while the application is connected in the background. If the message is in O:

-   -   if OC>0, OC is decremented (OC←OC−1) and C is decremented         (C←C−1)     -   The message is removed from O (O←O\Message)     -   The client sends a message to the server with a count of B     -   The server updates S to B (S←B)

At 343, a visible message may be decrypted while the application is visible in the foreground. In response to this event, not action is taken.

At 344, an invisible message may be decrypted, or a message may be dropped while the application is connected in the foreground state. In response to this event, no action is taken.

As compared to a conventional implementation, the following changes may be made to the protocol. First, the client may send its value for B to the server, with the stanza <ib><unread count=“N”></ib>, where N is a positive integer. Second, the client may send its active/inactive (i.e. foreground/background) state to the server with the stanza <ib><active state=“ActiveState”></ib>, where “ActiveState” is “true” when the app is in the foreground and “false” when the app is in the background. Prior to receiving this message, the server may default to the “background” state, because that state may be non-destructive to the existing unread count. Third, the following changes may be made to the server logic:

-   -   When a user logs in, the value for S may be stored in the         server's process dictionary.     -   The client may send stanzas to the server with updated unread         counts. The server may overwrite its stored value for S with the         most recent unread count from the client.     -   On logout, the server sends the unread count to the client and         erases it from its process dictionary.     -   When a user account is deleted, the unread count is removed.     -   The unread counts may be stored in a table and need not be         backed up, because they can be easily recovered from the client         on the next connection in the event of a server failure.         However, a server failure may cause clients to show the wrong         unread message count; clients may need to guard against this         eventuality by determining if a negative unread message count is         computed, and adjusting the value of U when this scenario         occurs.     -   When a message arrives while the user is offline, the server         increments S.     -   The server sends S as the unread message count in VOIP and APNS         pushes. The unread message count may be sent as part of the         header or as part of the payload of the push notification.     -   Messages in muted chats that would (conventionally) not have         triggered a push message may now result in the server         incrementing S and sending a push message to adjust the badge         count.

Next, exemplary logic 400 for computing an unread message count is described in connection with FIG. 4. All of the logical modules may be implemented in the same device, or may be distributed across any number of devices. Various combinations of modules may be employed on a given device, or the logic of an individual module may be performed by different devices.

Processing may begin at block 402, where the system (e.g. a client device) may run a communication application. The communication application may be capable of establishing a connection to a server to facilitate an exchange of messages between the client device and another client device. The messages may each be capable of being in a read state or an unread state.

At block 404, the system may count a number of messages that are considered unread by the communication application on the client device. The counting may account for any information received from the server (such as a server-side unread message count received as part of a push notification, as described above in connection with FIG. 3).

At block 406, the system may transmit the counted number of messages from the client to the server. The system may also (at block 408) transmit the state of the communication application (i.e., whether the application is in the foreground or background) to the server. The server may, in response to the information received at blocks 406 and/or 408, update its estimate of the unread message count. When initialized, the server may default to setting the communication application to a background state.

At block 410, the system may receive from the server, an unread message count in push notification. Based on the unread message count received from the server, the system may (at block 412) update the client's estimate of the number of messages considered to be unread based on the server's unread message count (as described above in connection with FIG. 3). The push notification may be configured to refrain from causing the communication application to wake up. The push notification may be received in response to the server receiving a message in a muted conversation.

At block 414, the system may update a badge of an icon of the communication application using an estimate of the unread message count based on the client's count of the unread messages and the server's estimate of the number of unread messages. Processing may then return to block 404, and the system may continue to recalculate the number of unread messages in accordance with the state diagram depicted in FIG. 3.

Communication System Overview

These examples may be implemented by a communications system that is provided either locally, at a client device, or remotely (e.g., at a remote server). FIGS. 5A-5C depict various examples of communications systems, and are discussed in more detail below.

FIG. 5A depicts an exemplary centralized communication system 500, in which functionality such as that described above is integrated into a communication server. The centralized system 500 may implement some or all of the structure and/or operations of a communication service in a single computing entity, such as entirely within a single centralized server device 526.

The communication system 500 may include a computer-implemented system having software applications that include one or more components. Although the communication system 500 shown in FIG. 5A has a limited number of elements in a certain topology, the communication system 500 may include more or fewer elements in alternate topologies.

A communication service 500 may be generally arranged to receive, store, and deliver messages. The communication service 500 may store messages or video communications while clients 520, such as may execute on client devices 510, are offline and deliver the messages/communications once the clients are available. Alternatively or in addition, the clients 520 may include social networking functionality.

A client device 510 may transmit messages addressed to a recipient user, user account, or other identifier resolving to a receiving client device 510. In exemplary embodiments, each of the client devices 510 and their respective communication clients 520 are associated with a particular user or users of the communication service 500. In some embodiments, the client devices 510 may be cellular devices such as smartphones and may be identified to the communication service 500 based on a phone number associated with each of the client devices 510. In some embodiments, each communication client may be associated with a user account registered with the communication service 500. In general, each communication client may be addressed through various techniques for the reception of messages. While in some embodiments the client devices 510 may be cellular devices, in other embodiments one or more of the client devices 510 may be personal computers, tablet devices, any other form of computing device.

The client 510 may include one or more input devices 512 and one or more output devices 518. The input devices 512 may include, for example, microphones, keyboards, cameras, electronic pens, touch screens, and other devices for receiving inputs including message data, requests, commands, user interface interactions, selections, and other types of input. The output devices 518 may include a speaker, a display device such as a monitor or touch screen, and other devices for presenting an interface to the communication system 500.

The client 510 may include a memory 519, which may be a non-transitory computer readable storage medium, such as one or a combination of a hard drive, solid state drive, flash storage, read only memory, or random access memory. The memory 519 may a representation of an input 514 and/or a representation of an output 516, as well as one or more applications. For example, the memory 519 may store a communication client 520 and/or a social networking client that allows a user to interact with a social networking service.

The input 514 may be textual, such as in the case where the input device 212 is a keyboard. Alternatively, the input 514 may be an audio recording, such as in the case where the input device 512 is a microphone. Accordingly, the input 514 may be subjected to automatic speech recognition (ASR) logic in order to transform the audio recording to text that is processable by the communication system 500. The ASR logic may be located at the client device 510 (so that the audio recording is processed locally by the client 510 and corresponding text is transmitted to the communication server 526), or may be located remotely at the communication server 526 (in which case, the audio recording may be transmitted to the communication server 526 and the communication server 526 may process the audio into text). Other combinations are also possible—for example, if the input device 512 is a touch pad or electronic pen, the input 514 may be in the form of handwriting, which may be subjected to handwriting or optical character recognition analysis logic in order to transform the input 512 into processable text.

The client 510 may be provided with a network interface 522 for communicating with a network 524, such as the Internet. The network interface 522 may transmit the input 512 in a format and/or using a protocol compatible with the network 524 and may receive a corresponding output 516 from the network 524.

The network interface 522 may communicate through the network 524 to a communication server 526. The communication server 526 may be operative to receive, store, and forward communications between clients.

The communication server 526 may include a network interface 522, communication preferences 528, and communications logic 530. The communication preferences 528 may include one or more privacy settings or other preferences for one or more users and/or message threads. Furthermore, the communication preferences 528 may include one or more settings, including default settings, for the logic described herein.

The communications logic 530 may include logic for implementing any or all of the above-described features of the present invention. Alternatively or in addition, some or all of the features may be implemented at the client 510-i, such as by being incorporated into an application such as the communication client 520.

The network interface 522 of the client 510 and/or the communication server 526 may also be used to communicate through the network 524 with an app server 540. The app server may store software or applications in an app library 544, representing software available for download by the client 510-i and/or the communication server 526 (among other entities). An app in the app library 544 may fully or partially implement the embodiments described herein. Upon receiving a request to download software incorporating exemplary embodiments, app logic 542 may identify a corresponding app in the app library 544 and may provide (e.g., via a network interface) the app to the entity that requested the software.

The network interface 522 of the client 510 and/or the communication server 526 may also be used to communicate through the network 524 with a social networking server 536. The social networking server 536 may include or may interact with a social networking graph 538 that defines connections in a social network. Furthermore, the communication server 526 may connect to the social networking server 536 for various purposes, such as retrieving connection information, communication history, event details, etc. from the social network.

A user of the client 510 may be an individual (human user), an entity (e.g., an enterprise, business, or third-party application), or a group (e.g., of individuals or entities) that interacts or communicates with or over the social networking server 536. The social-networking server 536 may be a network-addressable computing system hosting an online social network. The social networking server 536 may generate, store, receive, and send social-networking data, such as, for example, user-profile data, concept-profile data, social-graph information, or other suitable data related to the online social network. The social networking server 536 may be accessed by the other components of the network environment either directly or via the network 524.

The social networking server 536 may include an authorization server (or other suitable component(s)) that allows users to opt in to or opt out of having their actions logged by social-networking server 536 or shared with other systems (e.g., third-party systems, such as the communication server 526), for example, by setting appropriate privacy settings. A privacy setting of a user may determine what information associated with the user may be logged, how information associated with the user may be logged, when information associated with the user may be logged, who may log information associated with the user, whom information associated with the user may be shared with, and for what purposes information associated with the user may be logged or shared. Authorization servers may be used to enforce one or more privacy settings of the users of social-networking server 536 through blocking, data hashing, anonymization, or other suitable techniques as appropriate.

More specifically, one or more of the content objects of the online social network may be associated with a privacy setting. The privacy settings (or “access settings”) for an object may be stored in any suitable manner, such as, for example, in association with the object, in an index on an authorization server, in another suitable manner, or any combination thereof. A privacy setting of an object may specify how the object (or particular information associated with an object) can be accessed (e.g., viewed or shared) using the online social network. Where the privacy settings for an object allow a particular user to access that object, the object may be described as being “visible” with respect to that user. As an example and not by way of limitation, a user of the online social network may specify privacy settings for a user-profile page identify a set of users that may access the work experience information on the user-profile page, thus excluding other users from accessing the information. In particular embodiments, the privacy settings may specify a “blocked list” of users that should not be allowed to access certain information associated with the object. In other words, the blocked list may specify one or more users or entities for which an object is not visible. As an example and not by way of limitation, a user may specify a set of users that may not access photos albums associated with the user, thus excluding those users from accessing the photo albums (while also possibly allowing certain users not within the set of users to access the photo albums).

In particular embodiments, privacy settings may be associated with particular elements of the social networking graph 538. Privacy settings of a social-graph element, such as a node or an edge, may specify how the social-graph element, information associated with the social-graph element, or content objects associated with the social-graph element can be accessed using the online social network. As an example and not by way of limitation, a particular concept node corresponding to a particular photo may have a privacy setting specifying that the photo may only be accessed by users tagged in the photo and their friends. In particular embodiments, privacy settings may allow users to opt in or opt out of having their actions logged by social networking server 536 or shared with other systems. In particular embodiments, the privacy settings associated with an object may specify any suitable granularity of permitted access or denial of access. As an example and not by way of limitation, access or denial of access may be specified for particular users (e.g., only me, my roommates, and my boss), users within a particular degrees-of-separation (e.g., friends, or friends-of-friends), user groups (e.g., the gaming club, my family), user networks (e.g., employees of particular employers, students or alumni of particular university), all users (“public”), no users (“private”), users of third-party systems, particular applications (e.g., third-party applications, external websites), other suitable users or entities, or any combination thereof. Although this disclosure describes using particular privacy settings in a particular manner, this disclosure contemplates using any suitable privacy settings in any suitable manner.

In response to a request from a user (or other entity) for a particular object stored in a data store, the social networking server 536 may send a request to the data store for the object. The request may identify the user associated with the request. The requested data object may only be sent to the user (or a client system 510 of the user) if the authorization server determines that the user is authorized to access the object based on the privacy settings associated with the object. If the requesting user is not authorized to access the object, the authorization server may prevent the requested object from being retrieved from the data store, or may prevent the requested object from be sent to the user. In the search query context, an object may only be generated as a search result if the querying user is authorized to access the object. In other words, the object must have a visibility that is visible to the querying user. If the object has a visibility that is not visible to the user, the object may be excluded from the search results.

In some embodiments, targeting criteria may be used to identify users of the social network for various purposes. Targeting criteria used to identify and target users may include explicit, stated user interests on social-networking server 536 or explicit connections of a user to a node, object, entity, brand, or page on social networking server 536. In addition or as an alternative, such targeting criteria may include implicit or inferred user interests or connections (which may include analyzing a user's history, demographic, social or other activities, friends' social or other activities, subscriptions, or any of the preceding of other users similar to the user (based, e.g., on shared interests, connections, or events)). Particular embodiments may utilize platform targeting, which may involve platform and “like” impression data; contextual signals (e.g., “Who is viewing now or has viewed recently the page for a Soda Company?”); light-weight connections (e.g., “check-ins”); connection lookalikes; fans; extracted keywords; EMU advertising; inferential advertising; coefficients, affinities, or other social-graph information; friends-of-friends connections; pinning or boosting; deals; polls; household income, social clusters or groups; products detected in images or other media; social- or open-graph edge types; geo-prediction; views of profile or pages; status updates or other user posts (analysis of which may involve natural-language processing or keyword extraction); events information; or collaborative filtering. Identifying and targeting users may also implicate privacy settings (such as user opt-outs), data hashing, or data anonymization, as appropriate.

The centralized embodiment depicted in FIG. 5A may be well-suited to deployment as a new system or as an upgrade to an existing system, because the logic for implementing exemplary embodiments is incorporated into the communication server 526. In contrast, FIG. 5B depicts an exemplary distributed communication system 550, in which functionality for implementing exemplary embodiments is distributed and remotely accessible from the communication server. Examples of a distributed communication system 550 include a client-server architecture, a 3-tier architecture, an N-tier architecture, a tightly-coupled or clustered architecture, a peer-to-peer architecture, a master-slave architecture, a shared database architecture, and other types of distributed systems.

Many of the components depicted in FIG. 5B are identical to those in FIG. 5A, and a description of these elements is not repeated here for the sake of brevity (the app server 540 is omitted from the Figure for ease of discussion, although it is understood that this embodiment may also employ an app server 540). The primary difference between the centralized embodiment and the distributed embodiment is the addition of a separate processing server 552, which hosts the logic 530 for implementing exemplary embodiments. The processing server 552 may be distinct from the communication server 526 but may communicate with the communication server 526, either directly or through the network 524, to provide the functionality of the logic 530 and the logic 534 to the communication server 526.

The embodiment depicted in FIG. 5B may be particularly well suited to allow exemplary embodiments to be deployed alongside existing communication systems, for example when it is difficult or undesirable to replace an existing communication server. Additionally, in some cases the communication server 526 may have limited resources (e.g. processing or memory resources) that limit or preclude the addition of the additional pivot functionality. In such situations, the capabilities described herein may still be provided through the separate processing server 552.

In still further embodiments, the logic 532 may be provided locally at the client 510-i, for example as part of the communication client 520. In these embodiments, each client 510-i makes its own determination as to which messages belong to which thread, and how to update the display and issue notifications. As a result, different clients 510-i may display the same conversation differently, depending on local settings (for example, the same messages may be assigned to different threads, or similar threads may have different parents or highlights).

FIG. 5C illustrates an example of a social networking graph 538. In exemplary embodiments, a social networking service may store one or more social graphs 538 in one or more data stores as a social graph data structure via the social networking service.

The social graph 538 may include multiple nodes, such as user nodes 554 and concept nodes 556. The social graph 228 may furthermore include edges 558 connecting the nodes. The nodes and edges of social graph 228 may be stored as data objects, for example, in a data store (such as a social-graph database). Such a data store may include one or more searchable or queryable indexes of nodes or edges of social graph 228.

The social graph 538 may be accessed by a social-networking server 226, client system 210, third-party system (e.g., the translation server 224), or any other approved system or device for suitable applications.

A user node 554 may correspond to a user of the social-networking system. A user may be an individual (human user), an entity (e.g., an enterprise, business, or third-party application), or a group (e.g., of individuals or entities) that interacts or communicates with or over the social-networking system. In exemplary embodiments, when a user registers for an account with the social-networking system, the social-networking system may create a user node 554 corresponding to the user, and store the user node 30 in one or more data stores. Users and user nodes 554 described herein may, where appropriate, refer to registered users and user nodes 554 associated with registered users. In addition or as an alternative, users and user nodes 554 described herein may, where appropriate, refer to users that have not registered with the social-networking system. In particular embodiments, a user node 554 may be associated with information provided by a user or information gathered by various systems, including the social-networking system. As an example and not by way of limitation, a user may provide their name, profile picture, contact information, birth date, sex, marital status, family status, employment, education background, preferences, interests, or other demographic information. In particular embodiments, a user node 554 may be associated with one or more data objects corresponding to information associated with a user. In particular embodiments, a user node 554 may correspond to one or more webpages. A user node 554 may be associated with a unique user identifier for the user in the social-networking system.

In particular embodiments, a concept node 556 may correspond to a concept. As an example and not by way of limitation, a concept may correspond to a place (such as, for example, a movie theater, restaurant, landmark, or city); a website (such as, for example, a website associated with the social-network service or a third-party website associated with a web-application server); an entity (such as, for example, a person, business, group, sports team, or celebrity); a resource (such as, for example, an audio file, video file, digital photo, text file, structured document, or application) which may be located within the social-networking system or on an external server, such as a web-application server; real or intellectual property (such as, for example, a sculpture, painting, movie, game, song, idea, photograph, or written work); a game; an activity; an idea or theory; another suitable concept; or two or more such concepts. A concept node 556 may be associated with information of a concept provided by a user or information gathered by various systems, including the social-networking system. As an example and not by way of limitation, information of a concept may include a name or a title; one or more images (e.g., an image of the cover page of a book); a location (e.g., an address or a geographical location); a website (which may be associated with a URL); contact information (e.g., a phone number or an email address); other suitable concept information; or any suitable combination of such information. In particular embodiments, a concept node 556 may be associated with one or more data objects corresponding to information associated with concept node 556. In particular embodiments, a concept node 556 may correspond to one or more webpages.

In particular embodiments, a node in social graph 538 may represent or be represented by a webpage (which may be referred to as a “profile page”). Profile pages may be hosted by or accessible to the social-networking system. Profile pages may also be hosted on third-party websites associated with a third-party server. As an example and not by way of limitation, a profile page corresponding to a particular external webpage may be the particular external webpage and the profile page may correspond to a particular concept node 556. Profile pages may be viewable by all or a selected subset of other users. As an example and not by way of limitation, a user node 554 may have a corresponding user-profile page in which the corresponding user may add content, make declarations, or otherwise express himself or herself. A business page such as business page 205 may comprise a user-profile page for a commerce entity. As another example and not by way of limitation, a concept node 556 may have a corresponding concept-profile page in which one or more users may add content, make declarations, or express themselves, particularly in relation to the concept corresponding to concept node 556.

In particular embodiments, a concept node 556 may represent a third-party webpage or resource hosted by a third-party system. The third-party webpage or resource may include, among other elements, content, a selectable or other icon, or other inter-actable object (which may be implemented, for example, in JavaScript, AJAX, or PHP codes) representing an action or activity. As an example and not by way of limitation, a third-party webpage may include a selectable icon such as “like,” “check in,” “eat,” “recommend,” or another suitable action or activity. A user viewing the third-party webpage may perform an action by selecting one of the icons (e.g., “eat”), causing a client system to send to the social-networking system a message indicating the user's action. In response to the message, the social-networking system may create an edge (e.g., an “eat” edge) between a user node 554 corresponding to the user and a concept node 556 corresponding to the third-party webpage or resource and store edge 558 in one or more data stores.

In particular embodiments, a pair of nodes in social graph 538 may be connected to each other by one or more edges 558. An edge 558 connecting a pair of nodes may represent a relationship between the pair of nodes. In particular embodiments, an edge 558 may include or represent one or more data objects or attributes corresponding to the relationship between a pair of nodes. As an example and not by way of limitation, a first user may indicate that a second user is a “friend” of the first user. In response to this indication, the social-networking system may send a “friend request” to the second user. If the second user confirms the “friend request,” the social-networking system may create an edge 558 connecting the first user's user node 554 to the second user's user node 554 in social graph 538 and store edge 558 as social-graph information in one or more data stores. In the example of FIG. 5C, social graph 538 includes an edge 558 indicating a friend relation between user nodes 554 of user “Amanda” and user “Dorothy.” Although this disclosure describes or illustrates particular edges 558 with particular attributes connecting particular user nodes 554, this disclosure contemplates any suitable edges 558 with any suitable attributes connecting user nodes 554. As an example and not by way of limitation, an edge 558 may represent a friendship, family relationship, business or employment relationship, fan relationship, follower relationship, visitor relationship, subscriber relationship, superior/subordinate relationship, reciprocal relationship, non-reciprocal relationship, another suitable type of relationship, or two or more such relationships. Moreover, although this disclosure generally describes nodes as being connected, this disclosure also describes users or concepts as being connected. Herein, references to users or concepts being connected may, where appropriate, refer to the nodes corresponding to those users or concepts being connected in social graph 538 by one or more edges 558.

In particular embodiments, an edge 558 between a user node 554 and a concept node 556 may represent a particular action or activity performed by a user associated with user node 554 toward a concept associated with a concept node 556. As an example and not by way of limitation, as illustrated in FIG. 5C, a user may “like,” “attended,” “played,” “listened,” “cooked,” “worked at,” or “watched” a concept, each of which may correspond to a edge type or subtype. A concept-profile page corresponding to a concept node 556 may include, for example, a selectable “check in” icon (such as, for example, a clickable “check in” icon) or a selectable “add to favorites” icon. Similarly, after a user clicks these icons, the social-networking system may create a “favorite” edge or a “check in” edge in response to a user's action corresponding to a respective action. As another example and not by way of limitation, a user (user “Carla”) may listen to a particular song (“Across the Sea”) using a particular application (Music Service, which is an online music application). In this case, the social-networking system may create a “listened” edge 558 and a “used” edge (as illustrated in FIG. 5C) between user nodes 554 corresponding to the user and concept nodes 556 corresponding to the song and application to indicate that the user listened to the song and used the application. Moreover, the social-networking system may create a “played” edge 558 (as illustrated in FIG. 5C) between concept nodes 556 corresponding to the song and the application to indicate that the particular song was played by the particular application. In this case, “played” edge 558 corresponds to an action performed by an external application (Music Service) on an external audio file (the song “Across the Sea”). Although this disclosure describes particular edges 558 with particular attributes connecting user nodes 554 and concept nodes 556, this disclosure contemplates any suitable edges 558 with any suitable attributes connecting user nodes 554 and concept nodes 556. Moreover, although this disclosure describes edges between a user node 554 and a concept node 556 representing a single relationship, this disclosure contemplates edges between a user node 554 and a concept node 556 representing one or more relationships. As an example and not by way of limitation, an edge 558 may represent both that a user likes and has used at a particular concept. Alternatively, another edge 558 may represent each type of relationship (or multiples of a single relationship) between a user node 554 and a concept node 556 (as illustrated in FIG. 5C between user node 554 for user “Edwin” and concept node 556 for “Music Service”).

In particular embodiments, the social-networking system may create an edge 558 between a user node 554 and a concept node 556 in social graph 538. As an example and not by way of limitation, a user viewing a concept-profile page (such as, for example, by using a web browser or a special-purpose application hosted by the user's client system) may indicate that he or she likes the concept represented by the concept node 556 by clicking or selecting a “Like” icon, which may cause the user's client system to send to the social-networking system a message indicating the user's liking of the concept associated with the concept-profile page. In response to the message, the social-networking system may create an edge 558 between user node 554 associated with the user and concept node 556, as illustrated by “like” edge 558 between the user and concept node 556. In particular embodiments, the social-networking system may store an edge 558 in one or more data stores. In particular embodiments, an edge 558 may be automatically formed by the social-networking system in response to a particular user action. As an example and not by way of limitation, if a first user uploads a picture, watches a movie, or listens to a song, an edge 558 may be formed between user node 554 corresponding to the first user and concept nodes 556 corresponding to those concepts. Although this disclosure describes forming particular edges 558 in particular manners, this disclosure contemplates forming any suitable edges 558 in any suitable manner.

The social graph 538 may further comprise a plurality of product nodes. Product nodes may represent particular products that may be associated with a particular business. A business may provide a product catalog to a consumer-to-business service and the consumer-to-business service may therefore represent each of the products within the product in the social graph 538 with each product being in a distinct product node. A product node may comprise information relating to the product, such as pricing information, descriptive information, manufacturer information, availability information, and other relevant information. For example, each of the items on a menu for a restaurant may be represented within the social graph 538 with a product node describing each of the items. A product node may be linked by an edge to the business providing the product. Where multiple businesses provide a product, each business may have a distinct product node associated with its providing of the product or may each link to the same product node. A product node may be linked by an edge to each user that has purchased, rated, owns, recommended, or viewed the product, with the edge describing the nature of the relationship (e.g., purchased, rated, owns, recommended, viewed, or other relationship). Each of the product nodes may be associated with a graph id and an associated merchant id by virtue of the linked merchant business. Products available from a business may therefore be communicated to a user by retrieving the available product nodes linked to the user node for the business within the social graph 538. The information for a product node may be manipulated by the social-networking system as a product object that encapsulates information regarding the referenced product.

As such, the social graph 538 may be used to infer shared interests, shared experiences, or other shared or common attributes of two or more users of a social-networking system. For instance, two or more users each having an edge to a common business, product, media item, institution, or other entity represented in the social graph 538 may indicate a shared relationship with that entity, which may be used to suggest customization of a use of a social-networking system, including a messaging system, for one or more users.

The embodiments described above may be performed by a messaging architecture, an example of which is next described with reference to FIG. 6.

Messaging Architecture

FIG. 6 illustrates an embodiment of a plurality of servers implementing various functions of a messaging service 600. It will be appreciated that different distributions of work and functions may be used in various embodiments of a messaging service 600.

The messaging service 600 may comprise a domain name front end 602. The domain name front end 602 may be assigned one or more domain names associated with the messaging service 600 in a domain name system (DNS). The domain name front end 602 may receive incoming connections and distribute the connections to servers providing various messaging services.

The messaging service 602 may comprise one or more chat servers 604. The chat servers 604 may comprise front-end servers for receiving and transmitting user-to-user messaging updates such as chat messages. Incoming connections may be assigned to the chat servers 604 by the domain name front end 602 based on workload balancing.

The messaging service 600 may comprise backend servers 608. The backend servers 608 may perform specialized tasks in the support of the chat operations of the front-end chat servers 604. A plurality of different types of backend servers 608 may be used. It will be appreciated that the assignment of types of tasks to different backend serves 608 may vary in different embodiments. In some embodiments some of the back-end services provided by dedicated servers may be combined onto a single server or a set of servers each performing multiple tasks divided between different servers in the embodiment described herein. Similarly, in some embodiments tasks of some of dedicated back-end servers described herein may be divided between different servers of different server groups.

The messaging service 600 may comprise one or more offline storage servers 610. The one or more offline storage servers 610 may store messaging content for currently-offline messaging clients in hold for when the messaging clients reconnect.

The messaging service 600 may comprise one or more sessions servers 612. The one or more session servers 612 may maintain session state of connected messaging clients.

The messaging service 600 may comprise one or more presence servers 614. The one or more presence servers 614 may maintain presence information for the messaging service 600. Presence information may correspond to user-specific information indicating whether or not a given user has an online messaging client and is available for chatting, has an online messaging client but is currently away from it, does not have an online messaging client, and any other presence state.

The messaging service 600 may comprise one or more push storage servers 616. The one or more push storage servers 616 may cache push requests and transmit the push requests to messaging clients. Push requests may be used to wake messaging clients, to notify messaging clients that a messaging update is available, and to otherwise perform server-side-driven interactions with messaging clients.

The messaging service 600 may comprise one or more group servers 618. The one or more group servers 618 may maintain lists of groups, add users to groups, remove users from groups, and perform the reception, caching, and forwarding of group chat messages.

The messaging service 600 may comprise one or more block list servers 620. The one or more block list servers 620 may maintain user-specific block lists, the user-specific incoming-block lists indicating for each user the one or more other users that are forbidden from transmitting messages to that user. Alternatively or additionally, the one or more block list servers 620 may maintain user-specific outgoing-block lists indicating for each user the one or more other users that that user is forbidden from transmitting messages to. It will be appreciated that incoming-block lists and outgoing-block lists may be stored in combination in, for example, a database, with the incoming-block lists and outgoing-block lists representing different views of a same repository of block information.

The messaging service 600 may comprise one or more last seen information servers 622. The one or more last seen information servers 622 may receive, store, and maintain information indicating the last seen location, status, messaging client, and other elements of a user's last seen connection to the messaging service 600.

The messaging service 600 may comprise one or more key servers 624. The one or more key servers may host public keys for public/private key encrypted communication.

The messaging service 600 may comprise one or more profile photo servers 626. The one or more profile photo servers 626 may store and make available for retrieval profile photos for the plurality of users of the messaging service 600.

The messaging service 600 may comprise one or more spam logging servers 628. The one or more spam logging servers 628 may log known and suspected spam (e.g., unwanted messages, particularly those of a promotional nature). The one or more spam logging servers 628 may be operative to analyze messages to determine whether they are spam and to perform punitive measures, in some embodiments, against suspected spammers (users that send spam messages).

The messaging service 600 may comprise one or more statistics servers 630. The one or more statistics servers may compile and store statistics information related to the operation of the messaging service 600 and the behavior of the users of the messaging service 600.

The messaging service 600 may comprise one or more web servers 632. The one or more web servers 632 may engage in hypertext transport protocol (HTTP) and hypertext transport protocol secure (HTTPS) connections with web browsers.

The messaging service 600 may comprise one or more chat activity monitoring servers 634. The one or more chat activity monitoring servers 634 may monitor the chats of users to determine unauthorized or discouraged behavior by the users of the messaging service 600. The one or more chat activity monitoring servers 634 may work in cooperation with the spam logging servers 628 and block list servers 620, with the one or more chat activity monitoring servers 634 identifying spam or other discouraged behavior and providing spam information to the spam logging servers 628 and blocking information, where appropriate to the block list servers 620.

The messaging service 600 may comprise one or more sync servers 636. The one or more sync servers 636 may sync the messaging system 500 with contact information from a messaging client, such as an address book on a mobile phone, to determine contacts for a user in the messaging service 600.

The messaging service 600 may comprise one or more multimedia servers 638. The one or more multimedia servers may store multimedia (e.g., images, video, audio) in transit between messaging clients, multimedia cached for offline endpoints, and may perform transcoding of multimedia.

The messaging service 600 may comprise one or more payment servers 640. The one or more payment servers 640 may process payments from users. The one or more payment servers 640 may connect to external third-party servers for the performance of payments.

The messaging service 600 may comprise one or more registration servers 642. The one or more registration servers 642 may register new users of the messaging service 600.

The messaging service 600 may comprise one or more voice relay servers 644. The one or more voice relay servers 644 may relay voice-over-internet-protocol (VoIP) voice communication between messaging clients for the performance of VoIP calls.

The above-described methods may be embodied as instructions on a computer readable medium or as part of a computing architecture. FIG. 7 illustrates an embodiment of an exemplary computing architecture 700 suitable for implementing various embodiments as previously described. In one embodiment, the computing architecture 700 may comprise or be implemented as part of an electronic device, such as a computer 701. The embodiments are not limited in this context.

As used in this application, the terms “system” and “component” are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution, examples of which are provided by the exemplary computing architecture 700. For example, a component can be, but is not limited to being, a process running on a processor, a processor, a hard disk drive, multiple storage drives (of optical and/or magnetic storage medium), an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components can reside within a process and/or thread of execution, and a component can be localized on one computer and/or distributed between two or more computers. Further, components may be communicatively coupled to each other by various types of communications media to coordinate operations. The coordination may involve the uni-directional or bi-directional exchange of information. For instance, the components may communicate information in the form of signals communicated over the communications media. The information can be implemented as signals allocated to various signal lines. In such allocations, each message is a signal. Further embodiments, however, may alternatively employ data messages. Such data messages may be sent across various connections. Exemplary connections include parallel interfaces, serial interfaces, and bus interfaces.

The computing architecture 700 includes various common computing elements, such as one or more processors, multi-core processors, co-processors, memory units, chipsets, controllers, peripherals, interfaces, oscillators, timing devices, video cards, audio cards, multimedia input/output (I/O) components, power supplies, and so forth. The embodiments, however, are not limited to implementation by the computing architecture 700.

As shown in FIG. 7, the computing architecture 700 comprises a processing unit 702, a system memory 704 and a system bus 706. The processing unit 702 can be any of various commercially available processors, including without limitation an Athlon®, Duron® and Opteron® processors; embedded and secure processors; DragonBall® and PowerPC® processors; Cell processors; Celeron®, Core (2) Duo®, Itanium®, Pentium®, Xeon®, and XScale® processors; and similar processors. Dual microprocessors, multi-core processors, and other multi-processor architectures may also be employed as the processing unit 702.

The system bus 706 provides an interface for system components including, but not limited to, the system memory 704 to the processing unit 702. The system bus 706 can be any of several types of bus structure that may further interconnect to a memory bus (with or without a memory controller), a peripheral bus, and a local bus using any of a variety of commercially available bus architectures. Interface adapters may connect to the system bus 706 via a slot architecture. Example slot architectures may include without limitation Accelerated Graphics Port (AGP), Card Bus, (Extended) Industry Standard Architecture ((E)ISA), Micro Channel Architecture (MCA), NuBus, Peripheral Component Interconnect (Extended) (PCI(X)), PCI Express, Personal Computer Memory Card International Association (PCMCIA), and the like.

The computing architecture 700 may comprise or implement various articles of manufacture. An article of manufacture may comprise a computer-readable storage medium to store logic. Examples of a computer-readable storage medium may include any tangible media capable of storing electronic data, including volatile memory or non-volatile memory, removable or non-removable memory, erasable or non-erasable memory, writeable or re-writeable memory, and so forth. Examples of logic may include executable computer program instructions implemented using any suitable type of code, such as source code, compiled code, interpreted code, executable code, static code, dynamic code, object-oriented code, visual code, and the like. Embodiments may also be at least partly implemented as instructions contained in or on a non-transitory computer-readable medium, which may be read and executed by one or more processors to enable performance of the operations described herein.

The system memory 704 may include various types of computer-readable storage media in the form of one or more higher speed memory units, such as read-only memory (ROM), random-access memory (RAM), dynamic RAM (DRAM), Double-Data-Rate DRAM (DDRAM), synchronous DRAM (SDRAM), static RAM (SRAM), programmable ROM (PROM), erasable programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), flash memory, polymer memory such as ferroelectric polymer memory, ovonic memory, phase change or ferroelectric memory, silicon-oxide-nitride-oxide-silicon (SONOS) memory, magnetic or optical cards, an array of devices such as Redundant Array of Independent Disks (RAID) drives, solid state memory devices (e.g., USB memory, solid state drives (SSD) and any other type of storage media suitable for storing information. In the illustrated embodiment shown in FIG. 7, the system memory 704 can include non-volatile memory 708 and/or volatile memory 710. A basic input/output system (BIOS) can be stored in the non-volatile memory 708.

The computing architecture 700 may include various types of computer-readable storage media in the form of one or more lower speed memory units, including an internal (or external) hard disk drive (HDD) 712, a magnetic floppy disk drive (FDD) 714 to read from or write to a removable magnetic disk 716, and an optical disk drive 718 to read from or write to a removable optical disk 720 (e.g., a CD-ROM or DVD). The HDD 712, FDD 714 and optical disk drive 720 can be connected to the system bus 706 by an HDD interface 722, an FDD interface 724 and an optical drive interface 726, respectively. The HDD interface 722 for external drive implementations can include at least one or both of Universal Serial Bus (USB) and IEEE 694 interface technologies.

The drives and associated computer-readable media provide volatile and/or nonvolatile storage of data, data structures, computer-executable instructions, and so forth. For example, a number of program modules can be stored in the drives and memory units 708, 712, including an operating system 728, one or more application programs 730, other program modules 732, and program data 734. In one embodiment, the one or more application programs 730, other program modules 732, and program data 734 can include, for example, the various applications and/or components of the messaging system 500.

A user can enter commands and information into the computer 701 through one or more wire/wireless input devices, for example, a keyboard 736 and a pointing device, such as a mouse 738. Other input devices may include microphones, infra-red (IR) remote controls, radio-frequency (RF) remote controls, game pads, stylus pens, card readers, dongles, finger print readers, gloves, graphics tablets, joysticks, keyboards, retina readers, touch screens (e.g., capacitive, resistive, etc.), trackballs, trackpads, sensors, styluses, and the like. These and other input devices are often connected to the processing unit 702 through an input device interface 740 that is coupled to the system bus 706, but can be connected by other interfaces such as a parallel port, IEEE 694 serial port, a game port, a USB port, an IR interface, and so forth.

A monitor 742 or other type of display device is also connected to the system bus 706 via an interface, such as a video adaptor 744. The monitor 742 may be internal or external to the computer 701. In addition to the monitor 742, a computer typically includes other peripheral output devices, such as speakers, printers, and so forth.

The computer 701 may operate in a networked environment using logical connections via wire and/or wireless communications to one or more remote computers, such as a remote computer 744. The remote computer 744 can be a workstation, a server computer, a router, a personal computer, portable computer, microprocessor-based entertainment appliance, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer 701, although, for purposes of brevity, only a memory/storage device 746 is illustrated. The logical connections depicted include wire/wireless connectivity to a local area network (LAN) 748 and/or larger networks, for example, a wide area network (WAN) 750. Such LAN and WAN networking environments are commonplace in offices and companies, and facilitate enterprise-wide computer networks, such as intranets, all of which may connect to a global communications network, for example, the Internet.

When used in a LAN networking environment, the computer 701 is connected to the LAN 748 through a wire and/or wireless communication network interface or adaptor 752. The adaptor 752 can facilitate wire and/or wireless communications to the LAN 748, which may also include a wireless access point disposed thereon for communicating with the wireless functionality of the adaptor 752.

When used in a WAN networking environment, the computer 701 can include a modem 754, or is connected to a communications server on the WAN 750, or has other means for establishing communications over the WAN 750, such as by way of the Internet. The modem 754, which can be internal or external and a wire and/or wireless device, connects to the system bus 706 via the input device interface 740. In a networked environment, program modules depicted relative to the computer 701, or portions thereof, can be stored in the remote memory/storage device 746. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers can be used.

The computer 701 is operable to communicate with wire and wireless devices or entities using the IEEE 802 family of standards, such as wireless devices operatively disposed in wireless communication (e.g., IEEE 802.13 over-the-air modulation techniques). This includes at least Wi-Fi (or Wireless Fidelity), WiMax, and Bluetooth™ wireless technologies, among others. Thus, the communication can be a predefined structure as with a conventional network or simply an ad hoc communication between at least two devices. Wi-Fi networks use radio technologies called IEEE 802.13x (a, b, g, n, etc.) to provide secure, reliable, fast wireless connectivity. A Wi-Fi network can be used to connect computers to each other, to the Internet, and to wire networks (which use IEEE 802.3-related media and functions).

FIG. 8 is a block diagram depicting an exemplary communications architecture 800 suitable for implementing various embodiments as previously described. The communications architecture 800 includes various common communications elements, such as a transmitter, receiver, transceiver, radio, network interface, baseband processor, antenna, amplifiers, filters, power supplies, and so forth. The embodiments, however, are not limited to implementation by the communications architecture 800.

As shown in FIG. 8, the communications architecture 800 includes one or more clients 802 and servers 804. The clients 802 may implement the client device 510. The servers 804 may implement the server device 526. The clients 802 and the servers 804 are operatively connected to one or more respective client data stores 806 and server data stores 808 that can be employed to store information local to the respective clients 802 and servers 804, such as cookies and/or associated contextual information.

The clients 802 and the servers 804 may communicate information between each other using a communication framework 810. The communications framework 810 may implement any well-known communications techniques and protocols. The communications framework 810 may be implemented as a packet-switched network (e.g., public networks such as the Internet, private networks such as an enterprise intranet, and so forth), a circuit-switched network (e.g., the public switched telephone network), or a combination of a packet-switched network and a circuit-switched network (with suitable gateways and translators).

The communications framework 810 may implement various network interfaces arranged to accept, communicate, and connect to a communications network. A network interface may be regarded as a specialized form of an input output interface. Network interfaces may employ connection protocols including without limitation direct connect, Ethernet (e.g., thick, thin, twisted pair 10/100/1000 Base T, and the like), token ring, wireless network interfaces, cellular network interfaces, IEEE 802.8a-x network interfaces, IEEE 802.16 network interfaces, IEEE 802.20 network interfaces, and the like. Further, multiple network interfaces may be used to engage with various communications network types. For example, multiple network interfaces may be employed to allow for the communication over broadcast, multicast, and unicast networks. Should processing requirements dictate a greater amount speed and capacity, distributed network controller architectures may similarly be employed to pool, load balance, and otherwise increase the communicative bandwidth required by clients 802 and the servers 804. A communications network may be any one and the combination of wired and/or wireless networks including without limitation a direct interconnection, a secured custom connection, a private network (e.g., an enterprise intranet), a public network (e.g., the Internet), a Personal Area Network (PAN), a Local Area Network (LAN), a Metropolitan Area Network (MAN), an Operating Missions as Nodes on the Internet (OMNI), a Wide Area Network (WAN), a wireless network, a cellular network, and other communications networks.

FIG. 9 illustrates an embodiment of a device 900 for use in a multicarrier OFDM system, such as the messaging system 500. The device 900 may implement, for example, software components 902 as described with reference to the messaging component logic 600, the intent determination logic 700, and the group selection logic 800. The device 900 may also implement a logic circuit 904. The logic circuit 904 may include physical circuits to perform operations described for the messaging system 600. As shown in FIG. 9, device 900 may include a radio interface 906, baseband circuitry 908, and a computing platform 910, although embodiments are not limited to this configuration.

The device 900 may implement some or all of the structure and/or operations for the messaging system 500 and/or logic circuit 904 in a single computing entity, such as entirely within a single device. Alternatively, the device 900 may distribute portions of the structure and/or operations for the messaging system 600 and/or logic circuit 904 across multiple computing entities using a distributed system architecture, such as a client-server architecture, a 3-tier architecture, an N-tier architecture, a tightly-coupled or clustered architecture, a peer-to-peer architecture, a master-slave architecture, a shared database architecture, and other types of distributed systems. The embodiments are not limited in this context.

In one embodiment, the radio interface 906 may include a component or combination of components adapted for transmitting and/or receiving single carrier or multi-carrier modulated signals (e.g., including complementary code keying (CCK) and/or orthogonal frequency division multiplexing (OFDM) symbols) although the embodiments are not limited to any specific over-the-air interface or modulation scheme. The radio interface 906 may include, for example, a receiver 912, a transmitter 914 and/or a frequency synthesizer 916. The radio interface 906 may include bias controls, a crystal oscillator and/or one or more antennas 918. In another embodiment, the radio interface 906 may use external voltage-controlled oscillators (VCOs), surface acoustic wave filters, intermediate frequency (IF) filters and/or RF filters, as desired. Due to the variety of potential RF interface designs an expansive description thereof is omitted.

The baseband circuitry 908 may communicate with the radio interface 906 to process receive and/or transmit signals and may include, for example, an analog-to-digital converter 920 for down converting received signals, and a digital-to-analog converter 922 for up-converting signals for transmission. Further, the baseband circuitry 908 may include a baseband or physical layer (PHY) processing circuit 924 for PHY link layer processing of respective receive/transmit signals. The baseband circuitry 908 may include, for example, a processing circuit 926 for medium access control (MAC)/data link layer processing. The baseband circuitry 908 may include a memory controller 928 for communicating with the processing circuit 926 and/or a computing platform 910, for example, via one or more interfaces 930.

In some embodiments, the PHY processing circuit 924 may include a frame construction and/or detection module, in combination with additional circuitry such as a buffer memory, to construct and/or deconstruct communication frames, such as radio frames. Alternatively or in addition, the MAC processing circuit 926 may share processing for certain of these functions or perform these processes independent of the PHY processing circuit 924. In some embodiments, MAC and PHY processing may be integrated into a single circuit.

The computing platform 910 may provide computing functionality for the device 900. As shown, the computing platform 910 may include a processing component 932. In addition to, or alternatively of, the baseband circuitry 908, the device 900 may execute processing operations or logic for the messaging system 500 and logic circuit 904 using the processing component 932. The processing component 932 (and/or the PHY 924 and/or MAC 926) may comprise various hardware elements, software elements, or a combination of both. Examples of hardware elements may include devices, logic devices, components, processors, microprocessors, circuits, processor circuits, circuit elements (e.g., transistors, resistors, capacitors, inductors, and so forth), integrated circuits, application specific integrated circuits (ASIC), programmable logic devices (PLD), digital signal processors (DSP), field programmable gate array (FPGA), memory units, logic gates, registers, semiconductor device, chips, microchips, chip sets, and so forth. Examples of software elements may include software components, programs, applications, computer programs, application programs, system programs, software development programs, machine programs, operating system software, middleware, firmware, software modules, routines, subroutines, functions, methods, procedures, software interfaces, application program interfaces (API), instruction sets, computing code, computer code, code segments, computer code segments, words, values, symbols, or any combination thereof. Determining whether an embodiment is implemented using hardware elements and/or software elements may vary in accordance with any number of factors, such as desired computational rate, power levels, heat tolerances, processing cycle budget, input data rates, output data rates, memory resources, data bus speeds and other design or performance constraints, as desired for a given implementation.

The computing platform 910 may further include other platform components 934. Other platform components 934 include common computing elements, such as one or more processors, multi-core processors, co-processors, memory units, chipsets, controllers, peripherals, interfaces, oscillators, timing devices, video cards, audio cards, multimedia input/output (I/O) components (e.g., digital displays), power supplies, and so forth. Examples of memory units may include without limitation various types of computer readable and machine readable storage media in the form of one or more higher speed memory units, such as read-only memory (ROM), random-access memory (RAM), dynamic RAM (DRAM), Double-Data-Rate DRAM (DDRAM), synchronous DRAM (SDRAM), static RAM (SRAM), programmable ROM (PROM), erasable programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), flash memory, polymer memory such as ferroelectric polymer memory, ovonic memory, phase change or ferroelectric memory, silicon-oxide-nitride-oxide-silicon (SONOS) memory, magnetic or optical cards, an array of devices such as Redundant Array of Independent Disks (RAID) drives, solid state memory devices (e.g., USB memory, solid state drives (SSD) and any other type of storage media suitable for storing information.

The device 900 may be, for example, an ultra-mobile device, a mobile device, a fixed device, a machine-to-machine (M2M) device, a personal digital assistant (PDA), a mobile computing device, a smart phone, a telephone, a digital telephone, a cellular telephone, user equipment, eBook readers, a handset, a one-way pager, a two-way pager, a messaging device, a computer, a personal computer (PC), a desktop computer, a laptop computer, a notebook computer, a netbook computer, a handheld computer, a tablet computer, a server, a server array or server farm, a web server, a network server, an Internet server, a work station, a mini-computer, a main frame computer, a supercomputer, a network appliance, a web appliance, a distributed computing system, multiprocessor systems, processor-based systems, consumer electronics, programmable consumer electronics, game devices, television, digital television, set top box, wireless access point, base station, node B, evolved node B (eNB), subscriber station, mobile subscriber center, radio network controller, router, hub, gateway, bridge, switch, machine, or combination thereof. Accordingly, functions and/or specific configurations of the device 900 described herein, may be included or omitted in various embodiments of the device 900, as suitably desired. In some embodiments, the device 900 may be configured to be compatible with protocols and frequencies associated one or more of the 3GPP LTE Specifications and/or IEEE 1402.16 Standards for WMANs, and/or other broadband wireless networks, cited herein, although the embodiments are not limited in this respect.

Embodiments of device 900 may be implemented using single input single output (SISO) architectures. However, certain implementations may include multiple antennas (e.g., antennas 918) for transmission and/or reception using adaptive antenna techniques for beamforming or spatial division multiple access (SDMA) and/or using MIMO communication techniques.

The components and features of the device 900 may be implemented using any combination of discrete circuitry, application specific integrated circuits (ASICs), logic gates and/or single chip architectures. Further, the features of the device 900 may be implemented using microcontrollers, programmable logic arrays and/or microprocessors or any combination of the foregoing where suitably appropriate. It is noted that hardware, firmware and/or software elements may be collectively or individually referred to herein as “logic” or “circuit.”

It will be appreciated that the exemplary device 900 shown in the block diagram of FIG. 9 may represent one functionally descriptive example of many potential implementations. Accordingly, division, omission or inclusion of block functions depicted in the accompanying figures does not infer that the hardware components, circuits, software and/or elements for implementing these functions would be necessarily be divided, omitted, or included in embodiments.

At least one computer-readable storage medium 936 may include instructions that, when executed, cause a system to perform any of the computer-implemented methods described herein.

General Notes on Terminology

Some embodiments may be described using the expression “one embodiment” or “an embodiment” along with their derivatives. These terms mean that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment. Moreover, unless otherwise noted the features described above are recognized to be usable together in any combination. Thus, any features discussed separately may be employed in combination with each other unless it is noted that the features are incompatible with each other.

With general reference to notations and nomenclature used herein, the detailed descriptions herein may be presented in terms of program procedures executed on a computer or network of computers. These procedural descriptions and representations are used by those skilled in the art to most effectively convey the substance of their work to others skilled in the art.

A procedure is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. These operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic or optical signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It proves convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. It should be noted, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to those quantities.

Further, the manipulations performed are often referred to in terms, such as adding or comparing, which are commonly associated with mental operations performed by a human operator. No such capability of a human operator is necessary, or desirable in most cases, in any of the operations described herein, which form part of one or more embodiments. Rather, the operations are machine operations. Useful machines for performing operations of various embodiments include general purpose digital computers or similar devices.

Some embodiments may be described using the expression “coupled” and “connected” along with their derivatives. These terms are not necessarily intended as synonyms for each other. For example, some embodiments may be described using the terms “connected” and/or “coupled” to indicate that two or more elements are in direct physical or electrical contact with each other. The term “coupled,” however, may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other.

Various embodiments also relate to apparatus or systems for performing these operations. This apparatus may be specially constructed for the required purpose or it may comprise a general purpose computer as selectively activated or reconfigured by a computer program stored in the computer. The procedures presented herein are not inherently related to a particular computer or other apparatus. Various general purpose machines may be used with programs written in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these machines will appear from the description given.

It is emphasized that the Abstract of the Disclosure is provided to allow a reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, it can be seen that various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment. In the appended claims, the terms “including” and “in which” are used as the plain-English equivalents of the respective terms “comprising” and “wherein,” respectively. Moreover, the terms “first,” “second,” “third,” and so forth, are used merely as labels, and are not intended to impose numerical requirements on their objects.

What has been described above includes examples of the disclosed architecture. It is, of course, not possible to describe every conceivable combination of components and/or methodologies, but one of ordinary skill in the art may recognize that many further combinations and permutations are possible. Accordingly, the novel architecture is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims. 

The invention claimed is:
 1. A non-transitory computer-readable medium storing instructions that, when executed by a processor, cause the processor to: run a communication application on a client device, the communication application capable of establishing a connection to a server to facilitate an exchange of messages between the client device and another client device, the messages each capable of being in a read state or an unread state; determine, at the client device, a client estimate of a number of messages that are considered to be unread by the server and an adjustment factor known to the client but not the server for a number of messages in the client estimate that are known to be read; determine a corrected unread message count based on the client estimate and the adjustment factor; and transmit the corrected unread message count from the client to the server, the transmitting configured to cause the server to correct an unread message count maintained at the server.
 2. The medium of claim 1, further storing instructions for transmitting a background state of the communication application from the client to the server, the transmitting of the background state causing the server to correct the unread message count maintained at the server.
 3. The medium of claim 2, wherein the server defaults to setting the communication application to a backgrounded state.
 4. The medium of claim 1, further storing instructions for receiving, from the server, the unread message count in a push notification, and for updating the client estimate of the number of messages considered to be unread based on the unread message count.
 5. The medium of claim 4, wherein the push notification does not cause the communication application to wake up.
 6. The medium of claim 4, further storing instructions for receiving the unread message count in response to the server receiving a message in a muted conversation.
 7. The medium of claim 1, further storing instructions for updating a badge of an icon of the communication application using the estimate of the unread message count.
 8. A method comprising: running a communication application on a client device, the communication application capable of establishing a connection to a server to facilitate an exchange of messages between the client device and another client device, the messages each capable of being in a read state or an unread state; determining, at the client device, a client estimate of a number of messages that are considered to be unread by the server and an adjustment factor known to the client but not the server for a number of messages in the client estimate that are known to be read; determining a corrected unread message count based on the client estimate and the adjustment factor; and transmitting the corrected unread message count from the client to the server, the transmitting configured to cause the server to correct an unread message count maintained at the server.
 9. The method of claim 8, further comprising transmitting a background state of the communication application from the client to the server, the transmitting of the background state causing the server to correct the unread message count maintained at the server.
 10. The method of claim 9, wherein the server defaults to setting the communication application to a backgrounded state.
 11. The method of claim 8, further comprising receiving, from the server, the unread message count in a push notification, and for updating the client estimate of the number of messages considered to be unread based on the unread message count.
 12. The method of claim 11, wherein the push notification does not cause the communication application to wake up.
 13. The method of claim 11, further comprising receiving the unread message count in response to the server receiving a message in a muted conversation.
 14. The method of claim 8, further comprising updating a badge of an icon of the communication application using the estimate of the unread message count.
 15. An apparatus comprising: a processor circuit configured to run a communication application on a client device, the communication application capable of establishing a connection to a server to facilitate an exchange of messages between the client device and another client device, the messages each capable of being in a read state or an unread state; unread message counting logic executable on the processor circuit and configured to determine, at the client device, a client estimate of a number of messages that are considered to be unread by the server and an adjustment factor known to the client but not the server for a number of messages in the client estimate that are known to be read; determine a corrected unread message count based on the client estimate and the adjustment factor; and a network interface configured to transmit the corrected unread message count from the client to the server, the transmitting configured to cause the server to correct an unread message count maintained at the server.
 16. The apparatus of claim 15, and further storing instructions for transmitting a background state of the communication application from the client to the server, the transmitting of the background state causing the server to correct the unread message count maintained at the server.
 17. The apparatus of claim 15, wherein the network interface is further configured to receive, from the server, the unread message count in a push notification, and for updating the client estimate of the number of messages considered to be unread based on the unread message count.
 18. The apparatus of claim 17, wherein the push notification does not cause the communication application to wake up.
 19. The apparatus of claim 17, wherein the network interface is further configured to receive the unread message count in response to the server receiving a message in a muted conversation.
 20. Apparatus of claim 15, wherein the processor circuit is further configured to update a badge of an icon of the communication application using the estimate of the unread message count. 